A Capacitated Location Routing Problem with Semi Soft Time Windows
نویسندگان
چکیده
منابع مشابه
Location-Routing Problem with Fuzzy Time Windows and Traffic Time
The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard ...
متن کاملa hybrid meta-heuristic approach for the capacitated location-routing problem with hard time windows
the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...
متن کاملlocation-routing problem with fuzzy time windows and traffic time
the location-routing problem is a relatively new branch of logistics system. its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. in this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. another important issue in this regard ...
متن کاملA goal programming model for vehicle routing problem with backhauls and soft time windows
The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advanced Computational Techniques in Electromagnetics
سال: 2015
ISSN: 2194-0266
DOI: 10.5899/2015/acte-00197